منابع مشابه
Approximability of Partitioning Graphs with Supply and Demand
Article history: Received 28 March 2007 Accepted 14 March 2008 Available online 29 March 2008
متن کاملsupply and demand security of energy in central asia and the caucasus
امنیت انرژی به معنی عرضه مداوم و پایدار همراه با قیمت های معقول در حامل های انرژی، که تهدیدات امنیتی، سیاسی، اقتصادی، محیط زیستی و روانی را کاهش دهد. امروزه نفت و گاز تنها، کالای تجاری نیست بلکه بعنوان ابزار سیاسی مورد استفاده قرار می گیرد.اختلاف میان روسیه و اکراین بر سر انرژی در ژانویه 2006، تهدیدی برای امنیت انرژی اروپا ایجاد کرد. در این تحقیق ما تلاش کردیم که نقش انرژی آسیای میانه و قفقاز ر...
15 صفحه اولA Heuristic Method for Solving the Problem of Partitioning Graphs with Supply and Demand
In this paper we present a greedy algorithm for solving the problem of the maximum partitioning of graphs with supply and demand (MPGSD). The goal of the method is to solve the MPGSD for large graphs in a reasonable time limit. This is done by using a two stage greedy algorithm, with two corresponding types of heuristics. The solutions acquired in this way are improved by applying a computation...
متن کاملAn ant colony optimization algorithm for partitioning graphs with supply and demand
In this paper we focus on finding high quality solutions for the problem of maximum partitioning of graphs with supply and demand (MPGSD). There is a growing interest for the MPGSD due to its close connection to problems appearing in the field of electrical distribution systems, especially for the optimization of self-adequacy of interconnected microgrids. We propose an ant colony optimization ...
متن کاملPartitioning Trees with Supply, Demand and Edge-Capacity
Let T be a given tree. Each vertex of T is either a supply vertex or a demand vertex, and is assigned a positive number, called the supply or demand. Each demand vertex v must be supplied an amount of “power,” equal to the demand of v, from exactly one supply vertex through edges in T . Each edge is assigned a positive number called the capacity. One wishes to partition T into subtrees by delet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2009
ISSN: 0166-218X
DOI: 10.1016/j.dam.2008.08.012